Logical characterizations of simulation and bisimulation for fuzzy transition systems

نویسندگان

  • Hengyang Wu
  • Yuxin Deng
چکیده

Simulations and bisimulations are known to be useful for abstracting and comparing formal systems, and they have recently been introduced into fuzzy systems. In this study, we provide sound and complete logical characterizations for simulation and bisimulation, which are defined over fuzzy labeled transition systems via two variants of the Hennessy-Milner Logic. The logic for characterizing fuzzy simulation has neither negation nor disjunction, which is very different from the well-known logical characterizations of probabilistic simulations, although the completeness proofs of our characterization results are inspired by relevant research in probabilistic concurrency theory. The logic for characterizing fuzzy bisimulation also deviates from that for probabilistic bisimulations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressiveness of Probabilistic Modal Logics, Revisited

Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. Logical characterizations of probabilistic bisimulation and simulation were given by Desharnais et al. These results hold for systems defined on analytic state spaces and assume that there are countably many labels in the case of bisim...

متن کامل

Expressiveness of Probabilistic Modal Logics

Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. Logical characterizations of probabilistic bisimulation and simulation were given by Desharnais et al. These results hold for systems defined on analytic state spaces and assume that there are countably many labels in the case of bisim...

متن کامل

Bisimulation for BL-general fuzzy automata

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

متن کامل

A Logical Characterization of Efficiency Preorders

In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and weak bisimilarity, guided by a principle o...

متن کامل

Categorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems

Covariant-contravariant simulation and conformance simulation generalize plain simulation and try to capture the fact that it is not always the case that “the larger the number of behaviors, the better”. We have previously studied some of their properties, showing that they can be presented as particular instances of the general notion of categorical simulation developed by Hughes and Jacobs an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 301  شماره 

صفحات  -

تاریخ انتشار 2016